Enumeration of Graph Coverings and related Surface Topology

نویسنده

  • Jin Ho Kwak
چکیده

G: a connected finite simple graph with vertex set V (G) and edge set E(G). Neighborhood N(v) of v : the set of vertices adjacent to v ∈ V (G). A map p : G̃ → G is a covering of G if p : V (G̃) → V (G) is surjective and p|N(ṽ) : N(ṽ) → N(v) is bijective for ∀v ∈ V (G) and ∀ṽ ∈ p−1(v). It is an n-fold covering if p is n-to-one. A covering p : G̃ → G is regular (or, A-covering) if there is a subgroup A of the automorphism group Aut (G̃) of G̃ acting freely on G̃ so that the graph G is isomorphic to the quotient graph G̃/A, say by h, and the quotient map G̃ → G̃/A is the composition h ◦ p of p and h. Betti number β(G) of G: the number of independent cycles in G. D(G): the set of all directed edges risen from the edges in E(G). Iso (G; n) (resp. IsoR(G; n)): the number of isomorphism classes of (resp. regular) n-fold coverings of G. Isoc (G; n) (resp. IsocR(G; n)): the number of isomorphism classes of connected (resp. regular) n-fold coverings of G. Iso (G;A) (resp. Isoc (G;A)): the number of isomorphism classes of (resp. connected) A-coverings of G. Sn, Zn and D n : the symmetric group on n letters, the cycle group of order n and the dihedral group of order 2n, respectively. Permutation voltage assignment of G: a function φ from D(G) into Sn with the property that φ(vu) = φ(uv)−1 for each uv ∈ D(G). Ordinary A-voltage assignment of G: a function φ from D(G) into a group A with the property that φ(vu) = φ(uv)−1 for each uv ∈ D(G). Permutation derived graph G : V (G) = V (G)× {1, 2, · · · , n}, and (u, i) and (v, j) are adjacent iff e = uv ∈ D(G) and j = φ(e)(i). The first coordinate projection p : G → G is an n-fold covering. Ordinary derived graph G ×φ A : V (G ×φ A) = V (G) ×A, and (u, g) and (v, h) are adjacent iff e = uv ∈ D(G) and h = φ(e)g. The first coordinate projection pφ : G ×φ A → G is an A-covering. Two coverings pi : G̃i → G, i = 1, 2, are said to be isomorphic if there exists a graph isomorphism 8 : G̃1 → G̃2 such that p2 ◦8 = p1. Such a 8 is called a covering isomorphism. 11991 Mathematics Subject Classification: 57M12, 57M15, 05C30.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumerating branched orientable surface coverings over a non-orientable surface

The isomorphism classes of several types of graph coverings of a graph have been enumerated by many authors [M. Hofmeister, Graph covering projections arising from finite vector space over finite fields, Discrete Math. 143 (1995) 87–97; S. Hong, J.H. Kwak, J. Lee, Regular graph coverings whose covering transformation groups have the isomorphism extention property, Discrete Math. 148 (1996) 85–1...

متن کامل

Enumerating branched coverings over surfaces with boundaries

The number of nonisomorphic n-fold branched coverings over a given surface with a boundary is determined by the number of nonisomorphic n-fold graph coverings over a suitable bouquet of circles. A similar enumeration can be done for regular branched coverings. Some explicit formulae for enumerations are also obtained. © 2003 Elsevier Ltd. All rights reserved. MSC 2000: 05C10; 05C30; 57M12

متن کامل

Enumeration of ramified coverings of the sphere and 2-dimensional gravity

Let A be the algebra generated by the power series ∑nn−1qn/n! and ∑ nnqn/n! . We prove that many natural generating functions lie in this algebra: those appearing in graph enumeration problems, in the intersection theory of moduli spaces Mg,n and in the enumeration of ramified coverings of the sphere. We argue that ramified coverings of the sphere with a large number of sheets provide a model o...

متن کامل

Graph Covering and Its Generalization

We present some topics on graph covering and its generalization. We survey some results on enumeration of isomorphism classes of coverings of a graph and g-cyclic A-covers of a symmetric digraph, where $A$ is a finite group and $g\in A$ . We also mention some related questions.

متن کامل

Typical circulant double coverings of a circulant graph

Several isomorphism classes of graph coverings of a graph G have been enumerated by many authors. Kwak and Lee (Canad. J. Math. XLII (1990) 747) enumerated the isomorphism classes of graph bundles and those of n-fold coverings with respect to a group of automorphisms of the base graph G which 9x a spanning tree. Hofmeister (Discrete Math. 98 (1991) 175) independently enumerated the isomorphism ...

متن کامل

Enumerating typical abelian prime-fold coverings of a circulant graph

Enumerating the isomorphism classes of several types of graph coverings is one of the central research topics in enumerative topological graph theory (see [R. Feng, J.H. Kwak, J. Kim, J. Lee, Isomorphism classes of concrete graph coverings, SIAM J. Discrete Math. 11 (1998) 265–272; R. Feng, J.H. Kwak, Typical circulant double coverings of a circulant graph, Discrete Math. 277 (2004) 73–85; R. F...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998